Keyword Search on Large Graphs: A Survey
نویسندگان
چکیده
Abstract With the prevalence of Internet access and online services, various big graphs are generated in many real applications (e.g., social networks knowledge graphs). An important task on analyzing mining these is keyword search. Essentially, given a graph G query Q associated with set keywords, search aims to find substructure rooted tree or subgraph) S such that nodes collectively cover part all keywords , meanwhile, optimal some user specified semantics. Keyword can be applied real-life applications, as point-of-interests recommendation web facility. In spite great importance search, we, however, notice latest survey this topic far out date. Consequently, there prompt need conduct comprehensive research direction. Motivated by this, survey, we systematically review studies classifying existing works into different categories according specific problem definition. This provide researchers understanding solutions.
منابع مشابه
Top-K Nearest Keyword Search on Large Graphs
It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is attached with zero or more keywords, and each edge is assigned with a weight measuring its length. Given a query node q in G and a keyword λ, a k-NK query seek...
متن کاملRDivF: Diversifying Keyword Search on RDF Graphs
In this paper, we outline our ongoing work on diversifying keyword search results on RDF data. Given a keyword query over an RDF graph, we define the problem of diversifying the search results and we present diversification criteria that take into consideration both the content and the structure of the results, as well as the underlying
متن کاملKeyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural “lowest common denominator” representation which can combine relational, XML and HTML data. Responses to keyword queries are usually modeled as trees that connect nodes matching the keywords. In this paper we address the problem of keyword search on graphs that may be significantly lar...
متن کاملKeyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledge for its formulation. XKeyword is built on a relational database and, hence, can accommodate very large graphs. Query evaluation is optimized by using the graph’s schema. In particular, XKeyword consists of two stages...
متن کاملEffective Keyword Search in Graphs
Keyword search in node-labeled graphs finds subtrees of the graph whose nodes contain all of the input keywords. Previous work ranks answer trees using combinations of structural and contentbased metrics, such as path lengths between keywords or relevance of the labels in the answer tree to the query keywords. We propose two new ways to rank keyword search results over graphs. The first takes n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science and Engineering
سال: 2021
ISSN: ['2364-1541', '2364-1185']
DOI: https://doi.org/10.1007/s41019-021-00154-4